Recovery of Sparsely Corrupted Signals
نویسندگان
چکیده
منابع مشابه
Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements
This paper studies the problem of accurately recovering a structured signal from a small number of corrupted sub-Gaussian measurements. We consider three different procedures to reconstruct signal and corruption when different kinds of prior knowledge are available. In each case, we provide conditions (in terms of the number of measurements) for stable signal recovery from structured corruption...
متن کاملConvex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix
We address the problem of recovering a low-rank matrix that has a small fraction of its entries arbitrarily corrupted. This problem is recently attracting attention as nontrivial extension of the classical PCA (principal component analysis) problem with applications in image processing and model/system identification. It was shown that the problem can be solved via a convex optimization formula...
متن کاملExact Tensor Completion from Sparsely Corrupted Observations via Convex Optimization
This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that is similar to the SVD for matrices, and define a new notion of tensor rank re...
متن کاملOn the optimality of a L1/L1 solver for sparse signal recovery from sparsely corrupted compressive measurements
On the optimality of a ℓ 1 /ℓ 1 solver for sparse signal recovery from sparsely corrupted compressive measurements. Abstract This short note proves the ℓ 2 − ℓ 1 instance optimality of a ℓ 1 /ℓ 1 solver, i.e., a variant of basis pursuit denoising with a ℓ 1 fidelity constraint, when applied to the estimation of sparse (or compressible) signals observed by sparsely corrupted compressive measurem...
متن کاملExact Recovery of Sparsely-Used Dictionaries
We consider the problem of learning sparsely used dictionaries with an arbitrary square dictionary and a random, sparse coefficient matrix. We prove that O(n log n) samples are sufficient to uniquely determine the coefficient matrix. Based on this proof, we design a polynomial-time algorithm, called Exact Recovery of Sparsely-Used Dictionaries (ER-SpUD), and prove that it probably recovers the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2179701